A Heuristic Classifier Ensemble for Huge Datasets
Identifieur interne : 000525 ( Main/Exploration ); précédent : 000524; suivant : 000526A Heuristic Classifier Ensemble for Huge Datasets
Auteurs : Hamid Parvin [Iran] ; Behrouz Minaei [Iran] ; Hosein Alizadeh [Iran]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2011.
Abstract
Abstract: This paper proposes a heuristic classifier ensemble to improve the performance of learning in multiclass problems. Although the more accurate classifier leads to a better performance, there is another approach to use many inaccurate classifiers while each one is specialized for a few data in the problem space and using their consensus vote as the classifier. In this paper, some ensembles of classifiers are first created. The classifiers of each of these ensembles jointly work using majority weighting votes. The results of these ensembles are combined to decide the final vote in a weighted manner. Finally the outputs of these ensembles are heuristically aggregated. The proposed framework is evaluated on a very large scale Persian digit handwritten dataset and the experimental results show the effectiveness of the algorithm.
Url:
DOI: 10.1007/978-3-642-23620-4_7
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001726
- to stream Istex, to step Curation: 001631
- to stream Istex, to step Checkpoint: 000182
- to stream Main, to step Merge: 000531
- to stream Main, to step Curation: 000525
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A Heuristic Classifier Ensemble for Huge Datasets</title><author><name sortKey="Parvin, Hamid" sort="Parvin, Hamid" uniqKey="Parvin H" first="Hamid" last="Parvin">Hamid Parvin</name></author><author><name sortKey="Minaei, Behrouz" sort="Minaei, Behrouz" uniqKey="Minaei B" first="Behrouz" last="Minaei">Behrouz Minaei</name></author><author><name sortKey="Alizadeh, Hosein" sort="Alizadeh, Hosein" uniqKey="Alizadeh H" first="Hosein" last="Alizadeh">Hosein Alizadeh</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:84DDF1D194B897FF0DBCD0F113509372ECFF9895</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1007/978-3-642-23620-4_7</idno><idno type="url">https://api.istex.fr/document/84DDF1D194B897FF0DBCD0F113509372ECFF9895/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001726</idno><idno type="wicri:Area/Istex/Curation">001631</idno><idno type="wicri:Area/Istex/Checkpoint">000182</idno><idno type="wicri:doubleKey">0302-9743:2011:Parvin H:a:heuristic:classifier</idno><idno type="wicri:Area/Main/Merge">000531</idno><idno type="wicri:Area/Main/Curation">000525</idno><idno type="wicri:Area/Main/Exploration">000525</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A Heuristic Classifier Ensemble for Huge Datasets</title><author><name sortKey="Parvin, Hamid" sort="Parvin, Hamid" uniqKey="Parvin H" first="Hamid" last="Parvin">Hamid Parvin</name><affiliation wicri:level="1"><country xml:lang="fr">Iran</country><wicri:regionArea>School of Computer Engineering, Iran University of Science and Technology (IUST), Tehran</wicri:regionArea><wicri:noRegion>Tehran</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Iran</country></affiliation></author><author><name sortKey="Minaei, Behrouz" sort="Minaei, Behrouz" uniqKey="Minaei B" first="Behrouz" last="Minaei">Behrouz Minaei</name><affiliation wicri:level="1"><country xml:lang="fr">Iran</country><wicri:regionArea>School of Computer Engineering, Iran University of Science and Technology (IUST), Tehran</wicri:regionArea><wicri:noRegion>Tehran</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Iran</country></affiliation></author><author><name sortKey="Alizadeh, Hosein" sort="Alizadeh, Hosein" uniqKey="Alizadeh H" first="Hosein" last="Alizadeh">Hosein Alizadeh</name><affiliation wicri:level="1"><country xml:lang="fr">Iran</country><wicri:regionArea>School of Computer Engineering, Iran University of Science and Technology (IUST), Tehran</wicri:regionArea><wicri:noRegion>Tehran</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Iran</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2011</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">84DDF1D194B897FF0DBCD0F113509372ECFF9895</idno><idno type="DOI">10.1007/978-3-642-23620-4_7</idno><idno type="ChapterID">7</idno><idno type="ChapterID">Chap7</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: This paper proposes a heuristic classifier ensemble to improve the performance of learning in multiclass problems. Although the more accurate classifier leads to a better performance, there is another approach to use many inaccurate classifiers while each one is specialized for a few data in the problem space and using their consensus vote as the classifier. In this paper, some ensembles of classifiers are first created. The classifiers of each of these ensembles jointly work using majority weighting votes. The results of these ensembles are combined to decide the final vote in a weighted manner. Finally the outputs of these ensembles are heuristically aggregated. The proposed framework is evaluated on a very large scale Persian digit handwritten dataset and the experimental results show the effectiveness of the algorithm.</div></front></TEI><affiliations><list><country><li>Iran</li></country></list><tree><country name="Iran"><noRegion><name sortKey="Parvin, Hamid" sort="Parvin, Hamid" uniqKey="Parvin H" first="Hamid" last="Parvin">Hamid Parvin</name></noRegion><name sortKey="Alizadeh, Hosein" sort="Alizadeh, Hosein" uniqKey="Alizadeh H" first="Hosein" last="Alizadeh">Hosein Alizadeh</name><name sortKey="Alizadeh, Hosein" sort="Alizadeh, Hosein" uniqKey="Alizadeh H" first="Hosein" last="Alizadeh">Hosein Alizadeh</name><name sortKey="Minaei, Behrouz" sort="Minaei, Behrouz" uniqKey="Minaei B" first="Behrouz" last="Minaei">Behrouz Minaei</name><name sortKey="Minaei, Behrouz" sort="Minaei, Behrouz" uniqKey="Minaei B" first="Behrouz" last="Minaei">Behrouz Minaei</name><name sortKey="Parvin, Hamid" sort="Parvin, Hamid" uniqKey="Parvin H" first="Hamid" last="Parvin">Hamid Parvin</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000525 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000525 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:84DDF1D194B897FF0DBCD0F113509372ECFF9895
|texte= A Heuristic Classifier Ensemble for Huge Datasets
}}
| This area was generated with Dilib version V0.6.32. |  |